翻訳と辞書 |
2–3 heap In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2–3 tree. Time costs for some common heap operations are: * ''Delete-min'' takes amortized time. * ''Decrease-key'' takes constant amortized time. * ''Insertion'' takes constant amortized time. == References ==
* Tadao Takaoka. (''Theory of 2–3 Heaps'' ), Cocoon (1999).
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「2–3 heap」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|